Proof systems for Moss' coalgebraic logic
نویسندگان
چکیده
منابع مشابه
Proof systems for Moss' coalgebraic logic
We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced by L. Moss. The logic captures the behaviour of coalgebras for a large class of set functors. The syntax of the logic, defined uniformly with respect to a finitary coalgebraic type functor T , uses a single modal operator ∇T of arity given by the functor T itself, and its semantics is defined in term...
متن کاملProof systems for the coalgebraic cover modality
We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a sound and complete Hilbert-style axiomatization. Moreover, we give a two-sided sound and complete sequent calculus for the negation-free language, and for the language with negation we provide a one-sided sequent calculus which...
متن کاملCoalgebraic Predicate Logic: Equipollence Results and Proof Theory
The recently introduced Coalgebraic Predicate Logic (CPL) provides a general first-order syntax together with extra modal-like operators that are interpreted in a coalgebraic setting. The universality of the coalgebraic approach allows us to instantiate the framework to a wide variety of situations, including probabilistic logic, coalition logic or the logic of neighbourhood frames. The last ca...
متن کاملProof Manipulations for Logic Programming Proof Systems
Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. In this paper we present some initial work on the problem of making systematic the design of logic programming languages. In particular, we identify and discuss several key properties of proofs. A important aspect of this examinati...
متن کاملCoalgebraic Logic
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that innnitary modal logic contains characterizing formulas. That is, every model-world pair is characterized up to bisimulation by an innnitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.018